The global parametrix in the Riemann-Hilbert steepest descent analysis for orthogonal polynomials
نویسندگان
چکیده
In the application of the Deift-Zhou steepest descent method to the Riemann-Hilbert problem for orthogonal polynomials, a model Riemann-Hilbert problem that appears in the multi-cut case is solved with the use of hyperelliptic theta functions. We present here an alternative approach which uses meromorphic differentials instead of theta functions to construct the solution of the model Riemann-Hilbert problem. 1 The global parametrix 1.
منابع مشابه
8 M ay 2 00 6 Painlevé I asymptotics for orthogonal polynomials with respect to a varying quartic weight
We study polynomials that are orthogonal with respect to a varying quartic weight exp(−N (x 2 /2+tx 4 /4)) for t < 0, where the orthogonal-ity takes place on certain contours in the complex plane. Inspired by developments in 2D quantum gravity, Fokas, Its, and Kitaev, showed that there exists a critical value for t around which the asymptotics of the recurrence coefficients are described in ter...
متن کاملUniform Asymptotics for Discrete Orthogonal Polynomials with Respect to Varying Exponential Weights on a Regular Infinite Lattice
Abstract. We consider the large-N asymptotics of a system of discrete orthogonal polynomials on an infinite regular lattice of mesh 1 N , with weight e , where V (x) is a real analytic function with sufficient growth at infinity. The proof is based on formulation of an interpolation problem for discrete orthogonal polynomials, which can be converted to a Riemann-Hilbert problem, and steepest de...
متن کاملThe ∂ Steepest Descent Method and the Asymptotic Behavior of Polynomials Orthogonal on the Unit Circle with Fixed and Exponentially Varying Nonanalytic Weights
Abstract. We develop a new asymptotic method for the analysis of matrix Riemann-Hilbert problems. Our method is a generalization of the steepest descent method first proposed by Deift and Zhou; however our method systematically handles jump matrices that need not be analytic. The essential technique is to introduce nonanalytic extensions of certain functions appearing in the jump matrix, and to...
متن کاملMulti-critical unitary random matrix ensembles and the general Painlevé II equation
We study unitary random matrix ensembles of the form Z−1 n,N | detM | 2αe−N TrV dM, where α > −1/2 and V is such that the limiting mean eigenvalue density for n,N → ∞ and n/N → 1 vanishes quadratically at the origin. In order to compute the double scaling limits of the eigenvalue correlation kernel near the origin, we use the Deift/Zhou steepest descent method applied to the Riemann-Hilbert pro...
متن کاملMulti-critical unitary random matrix ensembles and the general Painlevé II equation
We study unitary random matrix ensembles of the form Z n,N | detM |2αe−N Tr V dM , where α > −1/2 and V is such that the limiting mean eigenvalue density for n,N → ∞ and n/N → 1 vanishes quadratically at the origin. In order to compute the double scaling limits of the eigenvalue correlation kernel near the origin, we use the Deift/Zhou steepest descent method applied to the Riemann-Hilbert prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009